Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies
نویسندگان
چکیده
منابع مشابه
Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies
Functional dependencies (FDs) and inclusion dependencies (INDs) are the most fundamental integrity constraints that arise in practice in relational databases. A given set of FDs does not interact with a given set of INDs if logical implication of any FD can be determined solely by the given set of FDs, and logical implication of any IND can be determined solely by the given set of INDs. The set...
متن کاملHow to Prevent Interaction of Functional and Inclusion Dependencies
Functional dependencies (FDs) and inclusion dependencies (INDs) are the most fundamental integrity constraints that arise in practice in relational databases. A given set of FDs does not interact with a given set of INDs if logical implication of any FD can be determined solely by the given set of FDs, and logical implication of any IND can be determined solely by the given set of INDs. We exhi...
متن کاملArmstrong Databases for Functional and Inclusion Dependencies
An Armstrong database is a database that obeys precisely a given set of sentences (and their logical consequences) and no other sentences of a given type. It is shown that if the sentences of interest are inclusion dependencies and standard functional dependencies (functional dependencies for which the left-hand side is nonempty), then there is always an Armstrong database for each set of sente...
متن کاملReasoning About Embedded Dependencies Using Inclusion Dependencies
The implication problem for the class of embedded dependencies is undecidable. However, this does not imply lackness of a proof procedure as exemplified by the chase algorithm. In this paper we present a complete axiomatization of embedded dependencies that is based on the chase and uses inclusion dependencies and implicit existential quantification in the intermediate steps of deductions.
متن کاملFunctional Dependencies between Variables
Itisa standard practice to de ne the truth conditionsfora rst-orderform ula with a quanti erin term sofassignm entsto individualvariables. For exam ple,letM be a m odeland s a function (assignm ent)which assignsto variableselem entsin thedom ain ofM .Then a formula 9x (x)istruein M undersi thereisan assignm entswhich di ersfrom satm ostin thevalue itassignsto x,such that (x)istrue on M unders. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00394-7